Epistemology Mathematicized “On [the] traditional view of the subject, the phrase ‘formal logic’ is pleonasm and ‘informal logic’ oxymoron.” John Burgess

Source URL: www.johnwoods.ca

• Philosophy
• Academia
• Epistemology
• Philosophy of science
• Critical thinking
• Statistical inference
• Logic
• Theory
• Philosophy of mathematics
• Formal epistemology
• Bayesian probability
• Mathematical proof

Proof mining in L1-approximation Ulrich Kohlenbach a,1, Paulo Oliva a,1 a Department of Computer Science, University of Aarhus, DK-8000 Aarhus C,

Source URL: www.mathematik.tu-darmstadt.de

• Mathematical analysis
• Mathematics
• Operator theory
• Computability theory
• Approximation theory
• Fourier analysis
• Modulus of continuity
• Primitive recursive function
• Linear temporal logic
• Differential forms on a Riemann surface

Fachbereich Mathematik Proof mining and combinatorics Program extraction for Ramsey’s theorem for pairs Vom Fachbereich Mathematik

Source URL: tuprints.ulb.tu-darmstadt.de

• Mathematics
• Topology
• Mathematical analysis
• Computability theory
• General topology
• Proof theory
• Mathematical logic
• Reverse mathematics
• BolzanoWeierstrass theorem
• HeineBorel theorem
• Intermediate value theorem
• Primitive recursive function

I NTRODUCTION P RINCIPLES ADMITTING A UNIVERSAL INSTANCE P RINCIPLES ADMITTING NO UNIVERSAL INSTANCE

Source URL: ludovicpatey.com

• Computability theory
• Mathematical logic
• Proof theory
• Reverse mathematics
• Model theory
• Axiom of choice

COQHOTT
 
 A NEW PROOF-ASSISTANT THAT REVISITS
 THE THEORETICAL FOUNDATIONS OF COQ USING 
 HOMOTOPY TYPE THEORY


Source URL: web.emn.fr

BRICS Basic Research in Computer Science BRICS RSU. Kohlenbach: On the No-Counterexample Interpretation On the No-Counterexample Interpretation

Source URL: www.mathematik.tu-darmstadt.de

• Mathematical logic
• Logic
• Proof theory
• Computability theory
• Mathematics
• Constructivism
• Primitive recursive functional
• First-order logic
• Symbol
• Primitive recursive function
• Primitive recursive arithmetic
• Realizability

A Hundred Impossibility Proofs for Distributed Computing Nancy A. Lynch * Lab for Computer Science MIT, Cambridge, MAlynchQtds.Ics.mit.edu

Source URL: groups.csail.mit.edu

• Fault-tolerant computer systems
• Mathematical logic
• Distributed computing
• Consensus
• Failure
• Theory of computation
• Proof of impossibility
• Algorithm
• Byzantine fault tolerance
• Parallel computing
• Shared register

Mathematical Curiosities Alfred S. Posamentier and Ingmar Lehmann Prometheus Books, 2014, ISBN4 The authors are well known as mathematical expositors, and produce about a book a year. This is their 2014

Source URL: www.austms.org.au

• Mathematics
• Academia
• Mathematics education
• Mental calculators
• Philosophy of mathematics
• Number theory
• Mathematician
• Pure mathematics
• Mathematical proof
• Paul Erds
• Srinivasa Ramanujan
• Prime number

Elicitable distortion risk measures: a concise proof Ruodu Wang∗ and Johanna F. Ziegel† February 4, 2015 Abstract Elicitability has recently been discussed as a desirable property for risk

Source URL: sas.uwaterloo.ca

• Mathematical analysis
• Mathematics
• Spectral theory
• Actuarial science
• Coherent risk measure
• Financial risk
• Mathematical finance
• RadonNikodym theorem
• Distribution
• Spectral theory of ordinary differential equations
• Decomposition of spectrum

Probabilistic Algorithms and Ramsey-Type Principles in Reverse Mathematics Laurent Bienvenu Ludovic Patey

Source URL: ludovicpatey.com

• Mathematics
• Logic
• Proof theory
• Mathematical proofs
• Lemma
• Theorem
• Abstraction
• Reverse mathematics
• BPP